PROSE: A Plugin-Based Paraconsistent OWL Reasoner
نویسندگان
چکیده
The study of paraconsistent reasoning with ontologies is especially important for the Semantic Web since knowledge is not always perfect within it. Quasi-classical semantics is proven to rationally draw more meaningful conclusions even from an inconsistent ontology with the stronger inference power of paraconsistent reasoning. In our previous work, we have conceived a quasi-classical framework called prose to provide rich paraconsistent reasoning services for OWL ontologies, whose architecture contains three parts: a classical OWL reasoner, a quasiclassical transformer, and OWL API connecting with them. This paper finally implements prose where quasi-classical transformer is bulit as a plugin for paraconsistent reasoning on classical reasoners. Additionally, we select three popular classical OWL reasoners (i.e., Pellet, HermiT, and FaCT++) and two typical kinds of reasoning services (i.e., QCconsistency checking and QC-classification) for users. As we excepted, prose does exactly enable current classical OWL reasoners to tolerate inconsistency in a simple and convenient way. Furthermore, we evaluate the three reasoners in three dimensions (class, property, individual) and, as a result, those results can amend the analysis of the three reasoners on inconsistent ontologies.
منابع مشابه
Inconsistency-tolerant reasoning with OWL DL
The Web Ontology Language (OWL) is a family of description logic based ontology languages for the Semantic Web and gives well defined meaning to web accessible information and services. The study of inconsistency-tolerant reasoning with description logic knowledge bases is especially important for the Semantic Web since knowledge is not always perfect within it. An important challenge is streng...
متن کاملParaconsistent Reasoning with OWL – Algorithms and the ParOWL Reasoner
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. Practical reasoning techniques for ontologies therefore will have to be tolerant to this kind of data, including the ability to handle inconsistencies in a meaningful way. For this purpose, we employ paraconsisten...
متن کاملAlgorithms for Paraconsistent Reasoning with OWL
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. Practical reasoning techniques for ontologies therefore will have to be tolerant to this kind of data, including the ability to handle inconsistencies in a meaningful way. For this purpose, we employ paraconsisten...
متن کاملOn the Satisfiability of Quasi-Classical Description Logics
Though quasi-classical description logic (QCDL) can tolerate the inconsistency of description logic in reasoning, a knowledge base in QCDL possibly has no model. In this paper, we investigate the satisfiability of QCDL, namely, QC-coherency and QCconsistency and develop a tableau calculus, as a formal proof, to determine whether a knowledge base in QCDL is QC-consistent. To do so, we repair the...
متن کاملAn Efficient Reasoner for Description Logics of Typicality and Rational Closure
In this work we present RAT-OWL, a Protégé 4.3 Plugin for reasoning about typicality in preferential Description Logics. RAT-OWL allows the user to reason in a nonmonotonic extension of Description Logics based on the notion of “rational closure”. This logic extends standard Description Logics in order to express “typical” properties, that can be directly specified by means of a typicality oper...
متن کامل